Unsupervised Trajectory Sampling.

T%2DWarehouse Visual OLAP analysis on trajectory data.

Ad%2Dhoc OLAP on Trajectory Data.

TACO tunable approximate computation of outliers in wireless sensor networks.

GF%2DMiner a Genetic Fuzzy Classifier for Numerical Data.

Geographic privacy%2Daware knowledge discovery and delivery.
In this report, we summarize the events of the First International
Clustering Trajectories of Moving Objects in an Uncertain World.

Trajectory Compression under Network Constraints.

Extendible Hashing.

Grid File %28and Family%29.

Linear Hashing.
Consider the set H of all linear (or affine) transformations between two vector spaces over a finite field F . We study how good H is as a class of hash functions, namely we consider hashing a set S of size n into a range having the same cardinality n by a randomly chosen function from H and look at the expected size of the largest hash bucket. H is a universal class of hash functions for any finite field, but with respect to our measure different fields behave differently. If the finite field F has n elements then there is a bad set S ae F  2  of size n with expected maximal bucket size\Omega\Gamma  n  1=3  ). If n is a perfect square then there is even a bad set with largest bucket size always at least  p  n. (This is worst possible, since with respect to a universal class of hash functions every set of size n has expected largest bucket size below  p  n + 1=2.) If, however, we consider the field of two elements then we get much better bounds. The best previously known upper bound on...
Primary Index.
One of the central knowledge sources of an information extraction (IE) system is a dictionary of linguistic patterns that can be used to identify references to relevant information in a text. Automatic creation of conceptual dictionaries is important for portability and scalability of an IE system. This paper describes CRYSTAL, a system which automatically induces a dictionary of &#034;concept-node definitions&#034; sufficient to identify relevant information from a training corpus. Each of these concept-node definitions is generalized as far as possible without producing errors, so that a minimum number of dictionary entries cover the positive training instances. Because it tests the accuracy of each proposed definition, CRYSTAL can often surpass human intuitions in creating reliable extraction rules. 1 Information Extraction An information extraction (IE) system analyzes unrestricted natural language text and produces a representation of the information from the text whichis cons...
R%2DTree %28and Family%29.

Secondary Index.
Let Σ be a finite, ordered alphabet, and consider a string x = x1x2... xn ∈ Σn. A secondary index for x answers alphabet range queries of the form: Given a range [al, ar]  ⊆ Σ, return the set I [al;ar]  = {i | xi ∈ [al; ar]}. Secondary indexes are heavily used in relational databases and scientific data analysis. It is well-known that the obvious solution, storing a dictionary for the set ⋃ i {xi} with a position set associated with each character, does not always give optimal query time. In this paper we give the first theoretically optimal data structure for the secondary indexing problem. In the I/O model, the amount of data read when answering a query is within a constant factor of the minimum space needed to represent the set I [al;ar], assuming that the size of internal memory is (|Σ | lg n) δ blocks, for some constant δ&gt; 0. The space usage of the data structure is O(n lg |Σ|) bits in the worst case, and we further show how to bound the size of the data structure in terms of the 0th order entropy of x. We show how to support updates achieving various time-space trade-offs. We also consider an approximate version of the basic secondary indexing problem where a query reports a superset of I [al;ar] containing each element not in I [al;ar] with probability at most ε, where ε&gt; 0 is the false positive probability. For this problem the amount of data that needs to be read by the query algorithm is reduced to O(|I [al;ar] | lg(1/ε)) bits. The main ideas for this work were conceived during
Spatial Indexing Techniques.

Spatio%2DTemporal Trajectories.

Tree%2Dbased Indexing.
As in conventional DataBase Management Systems (DBMSs), to allow users to efficiently access and retrieve data objects, a MultiMedia DataBase Management System (MMDBMS) must employ an effective access method such as indexing and hashing. This paper provides a survey of treebased multidimensional indexing techniques for MMDBMSs that maintain image data represented as feature vectors. These techniques support such data while maintaining desirable characteristics of a Btree, an index structure most commonly used in traditional DBMSs. In this survey, we provide descriptions of each tree as well as give examples of the different data organization schemes. We also describe the advantages and disadvantages of using each technique. In addition, we provide classifications of the trees using several different properties. These classifications should assist researchers in identifying the strengths and weaknesses of any new indexing technique they develop as well as help users determine the most appropriate data structure for their applications. 1.
The Panda framework for Comparing Patterns.

On the Effect of Location Uncertainty in Spatial Querying.

A Pattern Similarity Scheme for Medical Image Retrieval.

A Pattern Similarity Scheme for Medical Image Retrieval.

Monitoring Patterns through an Integrated Management and Mining Tool.

The DAEDALUS framework progressive querying and mining of movement data.

Pattern%2DMiner integrated management and mining over data mining models.

Pattern%2DMiner integrated management and mining over data mining models.

Building real%2Dworld trajectory warehouses.

Cost Models and Efficient Algorithms on Existentially Uncertain Spatial Data.

A general framework for estimating similarity of datasets and decision trees exploring semantic similarity of decision trees.
general framework for estimating similarity of datasets and decision trees: exploring semantic similarity of decision trees


Comparing Datasets Using Frequent Itemsets Dependency on the Mining Parameters.

HERMES aggregative LBS via a trajectory DB engine.

R%2DTrees %2D A Dynamic Index Structure for Spatial Searching.

Trajectory Data Models.
We propose a non-parametric model for pedestrian motion based on Gaussian Process regression, in which trajectory data are modelled by regressing relative motion against current position. We show how the underlying model can be learned in an unsupervised fashion, demonstrating this on two databases collected from static surveillance cameras. We furthermore exemplify the use of model for prediction, comparing the recently proposed GP-Bayesfilters with a Monte Carlo method. We illustrate the benefit of this approach for long term motion prediction where parametric models such as Kalman Filters would perform poorly. 1.
Trajectory Database Systems.
Abstract. In this paper, we describe an efficient indexing method for a shape-based similarity search of the trajectory of dynamically changing locations of people and mobile objects. In order to manage trajectories in database systems, we define a data model of trajectories as directed lines in a space, and the similarity between trajectories is defined as the Euclidean distance between directed discrete lines. Our proposed similarity query can be used to find interested patterns embedded into the trajectories, for example, the trajectories of mobile cars in a city may include patterns for expecting traffic jams. Furthermore, we propose an efficient indexing method to retrieve similar trajectories for a query by combining a spatial indexing technique (R +-Tree) and a dimension reduction technique, which is called PAA (Piecewise Approximate Aggregate). The indexing method can efficiently retrieve trajectories whose shape in a space is similar to the shape of a candidate trajectory from the database. 1
Seismological Data Warehousing and Mining A Survey.

Towards Trajectory Data Warehouses.

Seismological Data Warehousing and Mining A Survey.

On the Effect of Trajectory Compression in Spatiotemporal Querying.

Handling spatial vagueness in virtual agent control.

Index%2Dbased Most Similar Trajectory Search.
The problem of trajectory similarity in moving object databases is a relatively new topic in the spatial and spatiotemporal database literature. Existing work focuses on the spatial notion of similarity ignoring the temporal dimension of trajectories and disregarding the presence of a general-purpose spatiotemporal index. In this work, we address the issue of spatiotemporal trajectory similarity search by defining a similarity metric, proposing an efficient approximation method to reduce its calculation cost, and developing novel metrics and heuristics to support k-most-similar-trajectory search in spatiotemporal databases exploiting on existing R-treelike structures that are already found there to support more traditional queries. Our experimental study, based on real and synthetic datasets, verifies that the proposed similarity metric efficiently retrieves spatiotemporally similar trajectories in cases where related work fails, while at the same time the proposed algorithm is shown to be efficient and highly scalable. 1.
Mining Trajectory Databases via a Suite of Distance Operators.
With the rapid progress of mobile devices and positioning technologies, Trajectory Databases (TD) have been in the core of database research during the last decade. Analysis and knowledge discovery in TD is an emerging field which has recently gained great interest. Extracting knowledge from TD using certain types of mining techniques, such as clustering and classification, impose that there is a mean to quantify the distance between two trajectories. Having as a main objective the support of effective similarity query processing, existing approaches utilize generic distance metrics that ignore the peculiarities of the trajectories as complex spatiotemporal data types. In this paper, we define a novel set of trajectory distance operators based on primitive (space and time) as well as derived parameters of trajectories (speed and direction). Aiming at providing a powerful toolkit for analysts who require producing distance matrices with different semantics as input to mining tasks, we develop algorithms for each of the proposed operators. The efficiency of our approach is evaluated through an experimental study on classification and clustering tasks using synthetic and real trajectory datasets. 1.
Similarity Search in Trajectory Databases.

Towards the Next Generation of Location%2DBased Services.

Efficient algorithms for distortion and blocking techniques in association rule hiding.

Measuring Performance in the Retail Industry %28Position Paper%29.

Algorithms for Nearest Neighbor Search on Moving Object Trajectories.

Measuring Performance in the Retail Industry %28Position Paper%29.

Constrained subspace skyline computation.
In this paper we introduce the problem of Constrained Subspace Skyline Queries. This class of queries can be thought of as a generalization of subspace skyline queries using range constraints. Although both constrained skyline queries and subspace skyline queries have been addressed previously, the implications of constrained subspace skyline queries has not been examined so far. Constrained skyline queries are usually more expensive than regular skylines. In case of constrained subspace skyline queries additional performance degradation is caused through the projection. In order to support constrained skylines for arbitrary subspaces, we present approaches exploiting multiple low-dimensional indexes instead of relying on a single highdimensional index. Effective pruning strategies are applied to discard points from dominated regions. An important ingredient of our approach is the workload-adaptive strategy for determining the number of indexes and the assignment of dimensions to the indexes. Extensive performance evaluation shows the superiority of our proposed technique compared to its most related competitors.
MetaOn %2D Ontology Driven Metadata Construction and Management for Intelligent Search in Text and Image Collections.

Hermes %2D A Framework for Location%2DBased Data Management.
Abstract. The aim of this paper is to demonstrate Hermes, a robust framework capable of aiding a spatio-temporal database developer in modeling, constructing and querying a database with dynamic objects that change location, shape and size, either discretely or continuously in time. Hermes provides spatio-temporal functionality to state-of-the-art Object-Relational DBMS (ORDBMS). The prototype has been designed as an extension of STAU [6], which provides data management infrastructure for historical moving objects, so as to additionally support the demands of real time dynamic applications (e.g. Location-Based Services- LBS). The produced type system is packaged and provided as a data cartridge using the extensibility interface of Oracle10g. The offspring of the above framework extends PL/SQL with spatio-temporal semantics. The serviceableness of the resulting query language is demonstrated by realizing queries that have been proposed in [9] as a benchmarking framework for the evaluation of LBS. 1
MONIC modeling and monitoring cluster transitions.
We discover communities from social network data, and analyze the community evolution. These communities are inherent characteristics of human interaction in online social networks, as well as paper citation networks. Also, communities may evolve over time, due to changes to individuals’ roles and social status in the network as well as changes to individuals ’ research interests. We present an innovative algorithm that deviates from the traditional two-step approach to analyze community evolutions. In the traditional approach, communities are first detected for each time slice, and then compared to determine correspondences. We argue that this approach is inappropriate in applications with noisy data. In this paper, we propose FacetNet for analyzing communities and their evolutions through a robust unified
Boosting location%2Dbased services with a moving object database engine.
Composition of temporal and spatial properties of real world objects in a unified data framework results into Moving Object Databases (MOD). MODs are able to process, manage and analyze discretely or continuously changing spatio-temporal data. This paper presents HERMES Moving Data Cartridge, which provides MOD functionality to OpenGIS-compatible state-of-theart Object-Relational DBMS. HERMES is designed to be used as a pure temporal or a pure spatial system, however, its main application is to support modeling and querying of moving objects. A relevant collection of abstract data types (ADT) and their corresponding operations are defined, developed and provided as a data cartridge extending SQL-like query languages with MOD semantics. The usefuleness of the resulting query language is demonstrated by developing an application on top of this framework, which builds and visualizes the results of a palette of spatio-temporal queries that have been proposed in the literature as an advanced Location-Based Services (LBS) benchmarking framework for the evaluation of MOD engines.
Boosting location%2Dbased services with a moving object database engine.
Composition of temporal and spatial properties of real world objects in a unified data framework results into Moving Object Databases (MOD). MODs are able to process, manage and analyze discretely or continuously changing spatio-temporal data. This paper presents HERMES Moving Data Cartridge, which provides MOD functionality to OpenGIS-compatible state-of-theart Object-Relational DBMS. HERMES is designed to be used as a pure temporal or a pure spatial system, however, its main application is to support modeling and querying of moving objects. A relevant collection of abstract data types (ADT) and their corresponding operations are defined, developed and provided as a data cartridge extending SQL-like query languages with MOD semantics. The usefuleness of the resulting query language is demonstrated by developing an application on top of this framework, which builds and visualizes the results of a palette of spatio-temporal queries that have been proposed in the literature as an advanced Location-Based Services (LBS) benchmarking framework for the evaluation of MOD engines.


Indexed%2Dbased density biased sampling for clustering applications.

Database Support for Data Mining Patterns.
Abstract. The need of extracting useful knowledge from large collections of data has led to a great development of data mining systems and techniques. The results of data mining are known as patterns. Patterns can also be found in other scientific areas, such as biology, astronomy, mathematics etc. Today requirements impose the need for a system that efficiently manipulates complex and diverse patterns. In this work, we study the problem of the efficient representation and storage of patterns in a so-called pattern-base Management System. Towards this aim we examine three well known models from the database domain, the relational, the object-relational and the semi-structured (XML) model. The three alternative models are presented and compared based on criteria like generality, extensibility and querying effectiveness. The comparison shows that the semi-structure representation is more appropriate for a pattern-base. 1

Nearest Neighbor Search on Moving Object Trajectories.
Abstract. With the increasing number of Mobile Location Services (MLS), the need for effective k-NN query processing over historical trajectory data has become the vehicle for data analysis, thus improving existing or even proposing new services. In this paper, we investigate mechanisms to perform NN search on R-tree-like structures storing historical information about moving object trajectories. The proposed branch-and-bound algorithms vary with respect to the type of the query object (stationary or moving point) as well as the type of the query result (continuous or not). We also propose novel metrics to support our search ordering and pruning strategies. Using the implementation of the proposed algorithms on a member of the R-tree family for trajectory data (the TBtree), we demonstrate their scalability and efficiency through an extensive experimental study using synthetic and real datasets. 1

Spatial Joins Algorithms%2C Cost Models and Optimization Techniques.

Fuzzy Miner Extracting Fuzzy Rules from Numerical Patterns.


Report on the International Workshop on Pattern Representation and Management %28PaRMa%2704%29.

Proceedings of the Intl. Workshop on Pattern Representation and Management


Pattern management challenges.

A quantitative and qualitative ANALYSIS of blocking in association rule hiding.
ABSTRACT 1 Data mining provides the opportunity to extract useful information from large databases. Various techniques have been proposed in this context in order to extract this information in the most efficient way. However, efficiency is not our only concern in this study. The security and privacy issues over the extracted knowledge must be seriously considered as well. By taking this into consideration, we study the procedure of hiding sensitive association rules in binary data sets by blocking some data values and we present an algorithm for solving this problem. We also provide a fuzzification of the support and the confidence of an association rule in order to accommodate for the existence of blocked/unknown values. In addition, we quantitatively compare the proposed algorithm with other already published algorithms by running experiments on binary data sets, and we also qualitatively compare the efficiency of the proposed algorithm in hiding association rules. We utilize the notion of border rules, by putting weights in each rule, and we use effective data structures for the representation of the rules so as (a) to minimize the side effects created by the hiding process and (b) to speed up the selection of the victim transactions. Finally, we discuss the advantages and the limitations of blocking. Categories &amp; Subject Descriptors
Algorithms for processing K%2Dclosest%2Dpair queries in spatial databases.
This paper addresses the problem of finding the K closest pairs between two spatial datasets (the socalled,  K closest pairs query, K-CPQ), where each dataset is stored in an R-tree. There are two di#erent techniques for solving this kind of distance-based query. The first technique is the incremental approach, which returns the output elements one-by-one in ascending order of distance. The second one is the nonincremental alternative, which returns the K elements of the result all together at the end of the algorithm. In this paper, based on distance functions between two MBRs in the multidimensional Euclidean space, we propose a pruning heuristic and two updating strategies for minimizing the pruning distance, and use them in the design of three non-incremental branch-and-bound algorithms for K-CPQ between spatial objects stored in two R-trees. Two of those approaches are recursive following a Depth-First searching strategy and one is iterative obeying a Best-First traversal policy. The plane-sweep method and the search ordering are used as optimization techniques for improving the naive approaches. Besides, a number of interesting extensions of the K-CPQ (K-Self-CPQ, Semi-CPQ, K-FPQ (the K-farthest pairs query), etc.) are discussed. An extensive performance study is also presented. This study is based on experiments performed with real datasets. A wide range of values for the basic parameters a#ecting the performance of the algorithms is examined in order to designate the most e#cient algorithm for each setting of parameter values. Finally, an experimental study of the behavior of the proposed K-CPQ branch-and-bound algorithms in terms of scalability of the dataset size and the K value is also included.
Multi%2DWay Distance Join Queries in Spatial Databases.
Abstract. Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value ” of this n-tuple is the value of a linear function of distances of the n objects that make up this n-tuple, according to the edges of the QG. This paper addresses the problem of finding the Kn-tuples between n spatial datasets that have the smallest Ddistancevalues, the so-called K-Multi-Way Distance Join Query (K-MWDJQ), where each set is indexed by an R-tree-based structure. This query can be viewed as an extension of K-Closest-Pairs Query (K-CPQ) [4] for n inputs. In addition, a recursive non-incremental branch-and-bound algorithm following a Depth-First search for processing synchronously all inputs without producing any intermediate result is proposed. Enhanced pruning techniques are also applied to the n R-trees nodes in order to reduce the total response time of the query, and a global LRU buffer is used to reduce the number of disk accesses. Finally, an experimental study of the proposed algorithm using real spatial datasets is presented. Keywords: Spatial databases, Distance join queries, R-trees, Performance study 1
State%2Dof%2Dthe%2Dart in privacy preserving data mining.
We provide here an overview of the new and rapidly emerging research area of privacy preserving data mining. We also propose a classification hierarchy that sets the basis for analyzing the work which has been performed in this context. A detailed review of the work accomplished in this area is also given, along with the coordinates of each work to the classification hierarchy. A brief evaluation is performed, and some initial conclusions are made.
Distance Join Queries of Multiple Inputs in Spatial Databases.
Abstract. Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value ” of this n-tuple is the value of a linear function of distances of the n objects that make up this n-tuple, according to the edges of the QG. This paper addresses the problem of finding the Kn-tuples between n spatial datasets that have the smallest Ddistancevalues, the so-called K-Multi-Way Distance Join Query (K-MWDJQ), where each set is indexed by an R-tree-based structure. This query can be viewed as an extension of K-Closest-Pairs Query (K-CPQ) [4] for n inputs. In addition, a recursive non-incremental branch-and-bound algorithm following a Depth-First search for processing synchronously all inputs without producing any intermediate result is proposed. Enhanced pruning techniques are also applied to the n R-trees nodes in order to reduce the total response time of the query, and a global LRU buffer is used to reduce the number of disk accesses. Finally, an experimental study of the proposed algorithm using real spatial datasets is presented. Keywords: Spatial databases, Distance join queries, R-trees, Performance study 1
Advances in Spatial and Temporal Databases
We present here a theory of motion from a topological point of view, in a symbolic perspective. Taking space-time histories of objects as primitive entities, we introduce temporal and topological relations on the thus defined space-time to characterize classes of spatial changes. The theory thus accounts for qualitative spatial information, dealing with underspecified, symbolic information when accurate data is not available or unnecessary. We show that these structures give a basis for commonsense spatio-temporal reasoning by presenting a number of significant deductions in the theory. This can serve as a formal basis for languages describing motion events in a qualitative way.
Distance Join Queries of Multiple Inputs in Spatial Databases.
Abstract. Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value ” of this n-tuple is the value of a linear function of distances of the n objects that make up this n-tuple, according to the edges of the QG. This paper addresses the problem of finding the Kn-tuples between n spatial datasets that have the smallest Ddistancevalues, the so-called K-Multi-Way Distance Join Query (K-MWDJQ), where each set is indexed by an R-tree-based structure. This query can be viewed as an extension of K-Closest-Pairs Query (K-CPQ) [4] for n inputs. In addition, a recursive non-incremental branch-and-bound algorithm following a Depth-First search for processing synchronously all inputs without producing any intermediate result is proposed. Enhanced pruning techniques are also applied to the n R-trees nodes in order to reduce the total response time of the query, and a global LRU buffer is used to reduce the number of disk accesses. Finally, an experimental study of the proposed algorithm using real spatial datasets is presented. Keywords: Spatial databases, Distance join queries, R-trees, Performance study 1
Access Methods and Query Processing Techniques.
Abstract. A desirable feature in spatio-temporal databases is the ability to answer future queries, based on the current data characteristics (reference position and velocity vector). Given a moving query and a set of moving objects, a future query asks for the set of objects that satisfy the query in a given time interval. The difficulty in such a case is that both the query and the data objects change positions continuously, and therefore we can not rely on a given fixed reference position to determine the answer. Existing techniques are either based on sampling, or on repetitive application of time-parameterized queries in order to provide the answer. In this paper we develop an efficient method in order to process nearestneighbor queries in moving-object databases. The basic advantage of the proposed approach is that only one query is issued per time interval. The Time-Parameterized R-tree structure is used to index the moving objects. An extensive performance evaluation, based on CPU and I/O time, shows that significant improvements are achieved compared to existing techniques.
Spatio%2Dtemporal Databases in the Years Ahead.

Ten Benchmark Database Queries for Location%2Dbased Services.

Generating semantics%2Dbased trajectories of moving objects.
  The domain of spatiotemporal applications is a treasure  trove of new types of data as well as queries. For designing and  testing novel data types and access methods that will support these  applications, large spatiotemporal datasets are needed. As in many  cases it is not possible to obtain real datasets, either they do not  exist or they are not accessible, synthetic datasets are governed by  artificial parameters rather than by the (sometimes invisible) rules  governing real-world behavior. In this work we show how, at least  for some cases, one can generate spatiotemporal datasets that  simulate real-world behavior. We illustrate example cases and  translate them into appropriate calls of GSTD, a spatiotemporal data  generator. The generated data is illustrated using two-dimensional  snapshot pictures as well as three-dimensional (two spatial plus one  temporal dimension) trajectory images.   
Synthetic and Real Spatiotemporal Datasets.

Revisiting R%2DTree Construction Principles.
Spatial indexing is a well researched field that benefited computer  science with many outstanding results. Our effort in this paper can  be seen as revisiting some outstanding contributions to spatial indexing,  questioning some paradigms, and designing an access method with globally  improved performance characteristics. In particular, we argue that  dynamic R-tree construction is a typical clustering problem which can be  addressed by incorporating existing clustering algorithms. As a working  example, we adopt the well-known k-means algorithm. Further, we study  the effect of relaxing the &#034;two-way split procedure and propose a &#034;multiway  &#034; split, which inherently is supported by clustering techniques. We  compare our clustering approach to two prominent examples of spatial  access methods, the R- and the R*-tree.
An efficient and effective algorithm for density biased sampling.
In this paper we descr( e a new density-biased sampling algor (/(% It exploits spatial indexes and the local density infor7C6BH theypryCU( e, to pr vide impr ved quality of samplingr esult and fast access to elements of the dataset. It attains impr ved sampling quality, with rth ect to factor  like skew, noise or dimensionality.Mor$ ver it has the advantage of e#ciently handling dynamic updates, and it rC(/(%$ low execution times. The per(A7H)C6 of thepr( posed method is examined experCU$ tally. ThecomparC6) e rC(/(% illustr6) its superUB%$ y over existing methods. Keywords  ClusterC6) Density bias, Sampling, Spatial indexes 1. 
SEISMO%2DSURFER A Prototype for Collecting%2C Querying%2C and Mining Seismic Data.
Abstract. Earthquake phenomena constitute a rich source of information over the years. Typically, the frequency of earthquakes worldwide is one every second. Collecting and querying seismic data is a procedure useful for local authorities in order to keep citizens informed as well as for specialized scientists, such as seismologists, physicists etc., in order to study the phenomenon in its detail. A seismic data management system should meet certain requirements implied by the nature of seismic data. This kind of data is not solely characterized by alphanumeric attributes but also from a spatial and a temporal dimension (the epicenter and the time of earthquake realization, for example). Moreover, visualizing areas of interest, monitoring seismicity, finding hidden regularities or irregularities, and assisting to the understanding of regional historic seismic profiles are essential capabilities of such a system. Thus, a spatiotemporal database system, a set of data analysis and knowledge discovery techniques and a userfriendly visualization interface, compose the Seismo-Surfer, a prototype that, further to the above, aims to integrate seismic data repositories available over the WWW. 1
C2P Clustering based on Closest Pairs.
In this paper we present C 2 P, a new clustering algorithm for large spatial databases, which exploits spatial access methods for the determination of closest pairs. Several extensions are presented for scalable clustering in large databases that contain clusters of various shapes and outliers. Due to its characteristics, the proposed algorithm attains the advantages of hierarchical clustering and graphtheoretic algorithms providing both efficiency and quality of clustering result. The superiority of C 2 P is verified both with analytical and experimental results. 1
Constraint%2DBased Processing of Multiway Spatial Joins.
. A multiway spatial join combines information found in three or more spatial relations with respect to some spatial predicates. Motivated by their close correspondence with constraint satisfaction problems (CSPs), we show how multiway spatial joins can be processed by systematic search algorithms traditionally used for CSPs. This paper describes two different strategies, window reduction and synchronous traversal, that take advantage of underlying spatial indexes to prune the search space effectively. In addition, we provide cost models and optimization methods that combine the two strategies to compute more efficient execution plans. Finally, we evaluate the efficiency of the proposed techniques and the accuracy of the cost models through extensive experimentation with several query and data combinations.  Key Words. Spatial databases, Spatial joins, Constraint satisfaction, R-trees.  1. 
Closest Pair Queries in Spatial Databases.
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five different algorithms (four recursive and one iterative) are presented for solving this problem. The case of 1 closest pair is treated as a special case. An extensive study, based on experiments performed with synthetic as well as with real point data sets, is presented. A wide range of values for the basic parameters affecting the performance of the algorithms, especially the effect of overlap between the two data sets, is explored. Moreover, an algorithmic as well as an experimental comparison with existing incremental algorithms addressing the same problem is presented. In most settings, the new algorithms proposed clearly outperform the existing ones. 1
Novel Approaches in Query Processing for Moving Object Trajectories.

Efficient Cost Models for Spatial Queries Using R%2DTrees.
AbstractÐSelection and join queries are fundamental operations in Data Base Management Systems (DBMS). Support for nontraditional data, including spatial objects, in an efficient manner is of ongoing interest in database research. Toward this goal, access methods and cost models for spatial queries are necessary tools for spatial query processing and optimization. In this paper, we present analytical models that estimate the cost (in terms of node and disk accesses) of selection and join queries using R-treebased structures. The proposed formulae need no knowledge of the underlying R-tree structure(s) and are applicable to uniform-like and nonuniform data distributions. In addition, experimental results are presented which show the accuracy of the analytical estimations when compared to actual runs on both synthetic and real data sets. Index TermsÐSpatial databases, access methods, query optimization, cost models, R-trees. 1
Generating Spatiotemporal Datasets on the WWW.
Efficient storage, indexing and retrieval of time-evolving spatial data are some of the tasks that a Spatiotemporal Database Management System (STDBMS) must support. Aiming at designers of indexing methods and access structures, in this article we review the GSTD algorithm for generating spatiotemporal datasets according to several user-defined parameters, and introduce a WWW-based environment for generating and visualizing such datasets. The GSTD interface is available at two main sites: http://www.cti.gr/RD3/GSTD/ and http://www.cs.ualberta.ca/~mn/GSTD/.
Advanced Database Indexing

Beyond Current Technology The Perspective of Three EC GIS Projects.

Processing and Optimization of Multiway Spatial Joins Using R%2DTrees.
One of the most important types of query processing in spatial databases and geographic information systems is the spatial join, an operation that selects, from two relations, all object pairs satisfying some spatial predicate. A multiway join combines data originated from more than two relations. Although several techniques have been proposed for pairwise spatial joins, only limited work has focused on multiway spatial join processing. This paper solves multiway spatial joins by applying systematic search algorithms that exploit R-trees to efficiently guide search, without building temporary indexes or materializing intermediate results. In addition to general methodologies, we propose cost models and an optimization algorithm, and evaluate them through extensive experimentation.  
On the Generation of Spatiotemporal Datasets.
. An efficient benchmarking environment for spatiotemporal access  methods should at least include modules for generating synthetic datasets,  storing datasets (real datasets included), collecting and running access  structures, and visualizing experimental results. Focusing on the dataset  repository module, a collection of synthetic data that would simulate a variety  of real life scenarios is required. Several algorithms have been implemented in  the past to generate static spatial (point or rectangular) data, for instance,  following a predefined distribution in the workspace. However, by introducing  motion, and thus temporal evolution in spatial object definition, generating  synthetic data tends to be a complex problem. In this paper, we discuss the  parameters to be considered by a generator for such type of data, propose an  algorithm, called &#034;Generate_Spatio_Temporal_Data&#034; (GSTD), which generates  sets of moving point or rectangular data that follow an extended set of  distri...
Evaluation of Access Structures for Discretely Moving Points.
Several applications require management of data which is spatially dynamic, e.g., tracking of battle ships or moving cells in a blood sample. The capability of handling the temporal aspect, i.e., the history of such type of data, is also important. This paper presents and evaluates three temporal extensions of the R-tree, the 3D R-tree, the 2+3 R-tree and the HR-tree, which are capable of indexing spatiotemporal data. Our experiments focus on discretely moving points (i.e., points standing at a specific location for a time period and then moving &#034;instantaneously&#034;, and so on and so forth). We explore several parameters, e.g., initial spatial distribution, spatial query area and temporal query length. We found out that the HR-tree usually outperforms the other candidates, in terms of query processing cost, specially when querying time points and small time intervals. However, the main side effect of the HR-tree is its storage requirement, whichismuch larger than that of the o...
Cost Models for Join Queries in Spatial Databases.
: The join query is one of the fundamental operations in Data Base Management Systems (DBMSs). Modern DBMSs should be able to support non-traditional data, including spatial objects, in an efficient manner. Towards this goal, spatial data structures can be adopted in order to support the execution of join queries on sets of multidimensional data. This paper introduces analytical models that estimate the cost (in terms of node or disk accesses) of join queries involving two multidimensional indexed data sets using R-tree-based structures. In addition, experimental results are presented, which show the accuracy of the analytical estimations when compared to actual runs on both synthetic and real data sets. It turns out that the relative error rarely exceeds 15% for all combinations, a fact that makes the proposed cost models useful tools for efficient spatial query optimization.  1. Introduction  A Spatial Data Base Management System (SDBMS) should offer appropriate data types and query ...
Specifications for Efficient Indexing in Spatiotemporal Databases.
A new issue that arises in modern applications involves the efficient manipulation of (static or moving) spatial objects, and the relationships among them. As a result, modern database systems should be able to efficiently support that type of data. Towards this goal, appropriate extensions of multidimensional access methods can be exploited in order to index and retrieve spatiotemporal objects, satisfying users&#039; demands. This paper introduces the basic specifications such a spatiotemporal index structure should follow, evaluates existing proposals with respect to the above specifications, and illustrates issues of interest involving object representation, query processing, and index maintenance.
Direction Relations and Two%2DDimensional Range Queries Optimisation Techniques.
This paper defines direction relations (e.g., north, northeast) between two-dimensional objects  and shows how they can be efficiently retrieved using B-, KDB- and R- tree-based data  structures. Essentially, our work studies optimisation techniques for 2D range queries that  arise during the processing of direction relations. We test the efficiency of alternative indexing  methods through extensive experimentation and present analytical models that estimate their  performance. The analytical estimates are shown to be very close to the actual results and can  be used by spatial query optimizers in order to predict the retrieval cost. In addition, we  implement modifications of the existing structures that yield better performance for certain  queries. We conclude the paper by discussing the most suitable method depending on the type  of the range and the properties of the data.  KEYWORDS: spatial databases, direction relations, indexing methods, performance analysis.  1. 
Spatio%2DTemporal Composition and Indexing for Large Multimedia Applications.

Spatial Relations%2C Minimum Bounding Rectangles%2C and Spatial Data Structures.
Spatial relations are important in numerous domains, such as Spatial Query Languages,  Image and Multimedia Databases, Reasoning and Geographic Applications. This paper is concerned  with the retrieval of topological and direction relations using spatial data structures based on  Minimum Bounding Rectangles. We describe topological and direction relations between region  objects and we study the spatial information that Minimum Bounding Rectangles convey about the  actual objects they enclose. Then we apply the results in R-trees and their variations, R+-trees and R*-  trees, in order to minimise the number of disk accesses for queries involving topological and direction  relations. We also investigate queries that express complex spatial conditions in the form of  disjunctions and conjunctions, and we discuss possible extensions.
Point Representation of Spatial Objects and Query Window Extension A New Technique for Spatial Access Methods.

Spatio%2DTemporal Indexing for Large Multimedia Applications.
Multimedia applications usually involve a large number of multimedia objects (texts, images, sounds etc.). Spatial and temporal relationships among these objects should be efficiently supported and retrieved within a multimedia authoring tool. In this paper we present several spatial, temporal and spatio-temporal relationships of interest and propose efficient indexing schemes, based on multidimensional (spatial) data structures, for large multimedia applications that involve thousands of objects. Evaluation models of the proposed schemes are also presented as well as hints for the selection of the most appropriate one, according to the multimedia author&#039;s requirements.  1. Introduction  A Multimedia Application (MAP) involves a variety of individual multimedia objects presented according to the MAP scenario. The multimedia objects that participate in the MAP, called actors, are transformed either spatially or temporally in order to be presented according to author&#039;s requirements. More...
A Model for the Prediction of R%2Dtree Performance.
 In this paper we present an analytical model that predicts the performance of R-trees (and its variants) when a range query needs to be answered. The cost model uses knowledge of the dataset only, i.e., the proposed formula that estimates the number of disk accesses is a function of data properties, namely, the amount of data and their density in the work space. In other words, the proposed model is applicable even before the construction of the R-tree index, a fact that makes it a useful tool for dynamic spatial databases. Several experiments on synthetic and real datasets show that the proposed analytical model is very accurate, the relative error being usually around 10%-15%, for uniform and non-uniform distributions. We believe that this error is involved with the gap between efficient R-tree variants, like the R*-tree, and an optimum, not implemented yet, method. Our work extends previous research concerning R-tree analysis and constitutes a useful tool for spatial query optimiz...
A Model for the Prediction of R%2Dtree Performance.
 In this paper we present an analytical model that predicts the performance of R-trees (and its variants) when a range query needs to be answered. The cost model uses knowledge of the dataset only, i.e., the proposed formula that estimates the number of disk accesses is a function of data properties, namely, the amount of data and their density in the work space. In other words, the proposed model is applicable even before the construction of the R-tree index, a fact that makes it a useful tool for dynamic spatial databases. Several experiments on synthetic and real datasets show that the proposed analytical model is very accurate, the relative error being usually around 10%-15%, for uniform and non-uniform distributions. We believe that this error is involved with the gap between efficient R-tree variants, like the R*-tree, and an optimum, not implemented yet, method. Our work extends previous research concerning R-tree analysis and constitutes a useful tool for spatial query optimiz...


The Retrieval of Direction Relations using R%2Dtrees.%

Topological Relations in the World of Minimum Bounding Rectangles A Study with R%2Dtrees.
Recent developments in spatial relations have led to their use in numerous applications involving spatial databases. This paper is concerned with the retrieval of topological relations in Minimum Bounding Rectangle-based data structures. We study the topological information that Minimum Bounding Rectangles convey about the actual objects they enclose, using the concept of projections. Then we apply the results to R-trees and their variations, R-trees and R*-trees in order to minimise disk accesses for queries involving topological relations. We also investigate queries that involve complex spatial conditions in the form of disjunctions and conjunctions and we discuss possible extensions.
The Retrieval of Direction Relations using R%2Dtrees.%

Optimization Issues in R%2Dtree Construction %28Extended Abstract%29.
The construction of an efficient tree structure should take into account parameters that can be optimized. Coverage of a node, dead-area of a node and overlap between nodes are examples of such parameters. Existing access methods do not combine all these parameters. In this paper we study the effects of the above criteria on the performance of the R-tree structure and we propose a combination of all of them into a complex one that would be responsible for the tree construction.  1. Introduction  R-trees [GUTT84] are a direct extension of B-trees in k-dimensions. The data structure is a height-balanced tree which consists of intermediate and leaf nodes. The descriptions of data objects are stored in leaf nodes and intermediate nodes are built by grouping rectangles at the lower level. Data objects can be overlapping, covering each other, or completely disjoint; no assumption is made about their properties. The Minimum Bounding Rectangles (MBRs) of the actual data objects are assumed to ...
